Novel Algorithm for Mobile Robot Path Planning in Constrained Environment

نویسندگان

چکیده

This paper presents a development of novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot problem in two-dimensional map with presence constraints. approach gives possibility to find wheel considering some constraints during movement both known and unknown environments. The feasible is determined between start goal positions by generating wave points all direction towards point adhering In simulation, proposed method has been tested several working environments different degrees complexity. results demonstrated that able generate efficiently an optimal collision-free path. Moreover, performance was compared A-star laser (LS) algorithms terms length, computational time smoothness. revealed shortest less best smooth As average, GLS faster than A* LS 7.8 5.5 times, respectively shorter 1.2 1.5 times. order verify developed dealing constraints, experimental study carried out using Wheeled Mobile Robot (WMR) platform labs roads. work investigates complete autonomous WMR lab road live video streaming. Local maps were built data from streaming real-time image processing detect segments analogous-road or real-road shows trajectory comparison simulator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning Algorithm for Mobile Robot

The paper presents an algorithm for planning the path of a mobile robot in a labyrinth. The algorithm uses an image, obtained by a camera. The algorithm processes the image to convert it into a matrix, presenting the labyrinth with obstacles and walls. Afterwards the algorithm finds the shortest path to a final target in the labyrinth. As opposed to the classical Dijkstra’s algorithm, the prese...

متن کامل

Evolutionary Approach for Mobile Robot Path Planning in Complex environment

The shortest/optimal path planning in a static environment is essential for the efficient operation of a mobile robot. Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. In this paper, the problem of finding the optimal collision free path in complex environments f...

متن کامل

Design and Implementation of Path Planning Algorithm for Wheeled Mobile Robot in a Known Dynamic Environment

Path planning in mobile robots must ensure optimality of the path. The optimality achieved may be in path, time, energy consumed etc. Path planning in robots also depends on the environment in which it operates like, static or dynamic, known or unknown etc. Global path planning using A* algorithm and genetic algorithm is investigated in this paper. A known dynamic environment, in which a contro...

متن کامل

An effective hybrid algorithm for mobile robot global path planning

Ant Colony Optimization (ACO) exhibits parallelism, contains certain redundancy and historical information of the past solutions with pheromone trail, and is suitable for implementation on massively parallel architecture. But it is not easy to avoid local optima, especially for large-scale schedule problems. Simulated annealing (SA) is a naturally serial algorithm, but its behavior can be contr...

متن کامل

Path Planning of Mobile Robot in Unknown Environment

In this paper, we study the online path planning for khepera II mobile robot in an unknown environment. The well known heuristic A* algorithm is implemented to make the mobile robot navigate through static obstacles and find the shortest path from an initial position to a target position by avoiding the obstacles. The proposed path finding strategy is designed in a grid-map form of an unknown e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.020873